Graph Transformation with Time: Causality and Logical Clocks
نویسندگان
چکیده
Following TER nets, an approach to the modelling of time in high-level Petri nets, we propose a model of time within (attributed) graph transformation systems where logical clocks are represented as distinguished node attributes. Corresponding axioms for the time model in TER nets are generalised to graph transformation systems and semantic variations are discussed. They are summarised by a general theorem ensuring the consistency of temporal order and casual dependencies. The resulting notions of typed graph transformation with time specialise the algebraic doublepushout (DPO) approach to typed graph transformation. In particular, the concurrency theory of the DPO approach can be used in the transfer of the basic theory of TER nets.
منابع مشابه
Logical Physical Clocks
There is a gap between the theory and practice of distributed systems in terms of the use of time. The theory of distributed systems shunned the notion of time, and introduced “causality tracking” as a clean abstraction to reason about concurrency. The practical systems employed physical time (NTP) information but in a best effort manner due to the difficulty of achieving tight clock synchroniz...
متن کاملHighly Auditable Distributed Systems
Auditability is a key requirement for providing scalability and availability to distributed systems. Auditability allows us to identify latent concurrency bugs, dependencies among events, and performance bottlenecks. Our work focuses on providing auditability by combining two key concepts: time and causality. In particular, we prescribe hybrid logical clocks (HLC) which offer the functionality ...
متن کاملConcise Server-Wide Causality Management for Eventually Consistent Data Stores
Large scale distributed data stores rely on optimistic replication to scale and remain highly available in the face of network partitions. Managing data without coordination results in eventually consistent data stores that allow for concurrent data updates. These systems often use anti-entropy mechanisms (like Merkle Trees) to detect and repair divergent data versions across nodes. However, in...
متن کاملPreserving Local Time while Abstracting from Distributed Computations
A large number of tasks in distributed systems are based on the fundamental problem of getting a consistent view on a distributed computation’s causality, which is commonly solved by appliance of logical clocks as a means of capturing the flow of information within and among distributed processes. In the paper at hand it is discussed in detail how such a view, once properly constructed, might b...
متن کاملLogical Time
The notion of time seems to be elusive in distributed systems, where message delays are usually variable and where processes often do not have access to a global clock or to perfectly synchronized local clocks (see Clock Synchronization). On the other hand, time is an important concept in every day life of our “decentralized real world” and helps to solve problems like getting a consistent popu...
متن کامل